منابع مشابه
Grounding Formulas with Complex Terms
Given a finite domain, grounding is the the process of creating a variablefree first-order formula equivalent to a first-order sentence. As the first-order sentences can be used to describe a combinatorial search problem, efficient grounding algorithms would help in solving such problems effectively and makes advanced solver technology (such as SAT) accessible to a wider variety of users. One p...
متن کاملSyllogistic Logic with Complements
This paper continues the development of complete fragments of natural language by adding a noun-level complement operator to the basic syllogistic language of All X are Y and Some X are Y : in the fragment of this paper we can also say, for example, Some non-X are Y . We axiomatize this logic of this fragment in two ways: in a direct fashion, allowing the inference of an arbitrary sentence from...
متن کاملSyllogistic Logics with Verbs
This paper provides sound and complete logical systems for several fragments of English which go beyond syllogistic logic in that they use verbs as well as other limited syntactic material: universally and existentially quantified noun phrases, building on the work of Nishihara, Morita, and Iwata [7]; complemented noun phrases, following our [6]; and noun phrases which might contain relative cl...
متن کاملThe Syllogistic with Unity
We extend the language of the classical syllogisms with the sentenceforms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.
متن کاملSyllogistic Logic with Comparative Adjectives
This paper adds comparative adjectives to the known systems of syllogistic logic. The comparatives are interpreted by transitive and irreflexive relations. The main point is to obtain sound and complete axiomatizations of the logics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1972
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093894624